Course: B. Tech in Information Technology Sem: IV
Subject Name: Data Structures and Applications Subject Code: 24UD1246PC401
Max Marks: 60 Duration: 3 Hr.
| # | Question | Options | CO | Marks |
|---|---|---|---|---|
| 1 | What is the primary purpose of a data structure? | A) To create user interfaces B) To organize and store data efficiently C) To write efficient code D) To compile programs | CO1 | 1 |
| 2 | Which of the following is a linear data structure? | aA) Tree B) Graph C) Stack D) Heap | CO2 | 1 |
| 3 | In recursion, what is the role of a base case? | A) It initializes recursion B) It halts the recursive calls C) It defines the loop D) It increases time complexity | CO1 | 1 |
| 4 | Which notation represents the worst-case time complexity? | A) Big-O B) Omega C) Theta D) Lambda | CO1 | 1 |
| 5 | What does ADT stand for in data structures? | A) Advanced Data Tools B) Abstract Design Theory C) Abstract Data Type D) Actual Data Technique | CO2 | 1 |
| 6 | Which operation is not typically associated with stacks? | A) Push B) Pop C) Enqueue D) Peek | CO2 | 1 |
| 7 | Which queue allows insertion and deletion at both ends? | A) Circular Queue B) Priority Queue C) Deque D) Simple Queue | CO2 | 1 |
| 8 | Which data structure is used in BFS traversal of graphs? | A) Stack B) Queue C) Tree D) Heap | CO2 | 1 |
| 9 | Which sorting algorithm has the best average-case time complexity? | A) Insertion Sort B) Merge Sort C) Selection Sort D) Bubble Sort | CO2 | 1 |
| 10 | What is the time complexity of linear search in the worst case? | A) O(1) B) O(n log n) C) O(n) D) O(n²) | CO2 | 1 |
| 11 | Which binary tree traversal method results in sorted order for BST? | A) Preorder B) Postorder C) Inorder D) Level Order | CO2 | 1 |
| 12 | In which algorithm is a greedy approach used to find the Minimum Spanning Tree? | A) DFS B) BFS C) Prim’s Algorithm D) Dijkstra’s Algorithm | CO2 | 1 |
*** End ***